A Compression Method for STR

Over the recent years, many filtering algorithms have been developed for table constraints. Simple Tabular Reduction (STR) is an effective approach to filter table constraints. It maintains dynamically the list of supports in each constraint table during inference and search. However, for some specific problems, the approach that consists in representing tables in a compact way by means of multi-valued decision diagrams (MDD) overcomes STR. In this paper, we study the possibility of combining simple tabular reduction with tables compression based on the detection of recurrent patterns in tuples.